Natural Definability in Degree Structures
نویسندگان
چکیده
A major focus of research in computability theory in recent years has involved definability issues in degree structures. There has been much success in getting general results by coding methods that translate first or second order arithmetic into the structures. In this paper we concentrate on the issues of getting definitions of interesting, apparently external, relations on degrees that are order-theoretically natural in the structures D and R of all the Turing degrees and of the r.e. Turing degrees, respectively. Of course, we have no formal definition of natural but we offer some guidelines, examples and suggestions for further research.
منابع مشابه
Effective Reducibilities on Structures and Degrees of Presentability
In this survey paper we consider presentations of structures in admissible sets and some effective reducibilities between structures and their degrees of presentability. Degrees of Σ-definability of structures, as well as degrees of presentability with respect to different effective reducibilities, are natural measures of complexity which are total, i.e. defined for any structure. We also consi...
متن کاملDegree Structures
The Turing degrees 3d were introduced by Kleene and Post ([9], 1954) to isolate and study those properties of the subsets of the natural numbers N which are expressed purely in terms of relative computability. Intuitively, we form 3d by identifying any pair of subsets of N which are mutually computable and ordering the resulting equivalence classes by relative computability. The natural hierarc...
متن کاملArithmetical definability over finite structures
Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform and . We prove finite analogs of three classic results in arithmetical definability, namely that and TIMES can first-order define PLUS, that and DIVIDES can first-order define TIM...
متن کاملDefining Recursive Predicates in Graph Orders
We study the first order theory of structures over graphs i.e. structures of the form (G, τ ) where G is the set of all (isomorphism types of) finite undirected graphs and τ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine recognizable string encodings of graphs. We introduce the notion of a capable structure over graphs, which is one satisfying th...
متن کاملDiscontinuous Phenomena and Turing Definability
We discuss the relationship between discontinuity and definability in the Turing degrees, with particular reference to degree invariant solutions to Post’s Problem. Proofs of new results concerning definability in lower cones are outlined.
متن کامل